Fairness in Periodic Real-Time Scheduling
نویسنده
چکیده
The issue of temporal fairness in periodic real-time scheduling is considered. It is argued that such fairness is often a desirable characteristic in real-time schedules. A concrete criterion for temporal fairness | pfairness | is described. The weight-monotonic scheduling algorithm, a static priority scheduling algorithm for generating pfair schedules, is presented and proven correct. A feasibility test is presented which, if satis ed by a system of periodic tasks, ensures that the weight-monotonic scheduling algorithm will schedule the system in a pfair manner.
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملFair Scheduling of Real-Time Tasks on Multiprocessors
There has been much recent interest in fair scheduling algorithms for real-time multiprocessor systems. The roots of much of the research on this topic can be traced back to the seminal work of Baruah et al. on Proportionate fairness (Pfairness) [6]. This work proved that the problem of optimally scheduling periodic tasks1 on multiprocessors could be solved on-line in polynomial time by using P...
متن کاملMultiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making scheduling decisions in every time unit to enforce proportional progress for each task. In this paper, we will propose a novel scheduling algorithm, boundary fair (BF ), which makes scheduling decisions and enforces fairness ...
متن کاملAn optimal boundary fair scheduling algorithm for multiprocessor real-time systems
With the emergence of multicore processors, the research on multiprocessor real-time scheduling has caught more researchers’ attention recently. Although the topic has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks with quantum-based computation requirements and implicit deadlines, we propose a novel o...
متن کاملScheduling Periodic and Aperiodic Messages in Fibre Channel Arbitrated Loop
This paper addresses the problem of delivering real-time messages, both periodic and aperiodic, over Fibre Channel Arbitrated Loop or FC-AL. Periodic messages typically have hard real-time constraints whereas aperiodic tasks are delivered based on the best-eeort approach. The deadlines of periodic messages are guaranteed by limiting the packet size under the access fairness algorithm deened in ...
متن کامل